Image Encryption by Pixel Property Separation

نویسندگان

  • Karthik Chandrashekar Iyer
  • Aravinda Subramanya
چکیده

Pixels in an image are essentially constituted of two properties, position and colour. Pixel Property Separation, a radically different approach for Symmetric-key image encryption, separates these properties to disturb the semantics of the image. The scheme operates in two orthogonal stages each requiring an encryption key. The first stage creates the Position Vector, an ordered set of Pixel Position Information controlled by a set of plaintext dependent Random Permutations. A bitmap flagging the presence of all the 24 bit colours is generated. The second stage randomly positions the image width and height within the ciphertext and finally applies a byte transposition on the ciphertext bytes. The complete set of image properties including width, height and pixel position-colour correlation are obscured, resulting in a practically unbreakable encryption. The orthogonality of the stages acts as an anti-catalyst for cryptanalysis. The information retrieved from compromising a stage is totally independent and cannot be used to derive the other. Classical cryptanalytic techniques demand huge number of attempts, most failing to generate valid encryption information. Plaintext attacks are rendered ineffective due to the dependency of the Random Permutations on the plaintext. Linear and Differential cryptanalysis are highly inefficient due to high Diffusion and Confusion. Although the paper describes the algorithm as applied to images, its applicability is not limited to images only. The cryptographic strength is independent of the nature of the plaintext.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Image Encryption Based on Balanced Cellular Automaton and Pixel Separation

The purpose of image encryption is to protect content from unauthorized access. Image encryption is usually done by pixel scrambling and confusion, so process is possible to reverse only by knowing secret information. In this paper we introduce a new method for digital image encryption, based on a 2D cellular automaton and pixel separation. Novelty in the proposed method lies in the application...

متن کامل

ارائه روشی برای رمزنگاری تصاویر با استفاده از اتوماتای سلولی ترکیبی

In this paper, a new structure for image encryption using hybrid cellular automata is presented. The image encryption is done in two steps. At the first step, each pixel is encrypted by rules of hybrid cellular automata. In the next step, each pixel converted to a binary number and each bit is encrypted by rules of cellular automata. The rules are made by a function. Due to reversibility of cel...

متن کامل

Image encryption based on chaotic tent map in time and frequency domains

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

متن کامل

A stack-based chaotic algorithm for encryption of colored images

In this paper, a new method is presented for encryption of colored images. This method is based on using stack data structure and chaos which make the image encryption algorithm more efficient and robust. In the proposed algorithm, a series of data whose range is between 0 and 3 is generated using chaotic logistic system. Then, the original image is divided into four subimages, and these four i...

متن کامل

A New Method for Encryption of Color Images based on Combination of Chaotic Systems

This paper presents a new method for encryption of color images based on a combination of chaotic systems, which makes the image encryption more efficient and robust. The proposed algorithm generated three series of data, ranged between 0 and 255, using a chaotic Chen system. Another Chen system was then started with different initial values, which were converted to three series of numbers from...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009